def falling(n, k):
    """Compute the falling factorial of n to depth k."""
    ans = 1
    for i in range(n, n - k, -1):
        ans *= i
    return ans


def divisible_by_k(n, k):
    """
    Print all positive integers less than or equal to n that are divisible by k from smallest to largest.
    Then return how many numbers were printed.
    """
    cnt = 0
    for i in range(k, n + 1, k):
        print(i)
        cnt += 1
    return cnt


def sum_digits(y):
    """Sum all the digits of y."""
    sum = 0
    while y > 0:
        sum += y % 10
        y //= 10
    return sum


def double_eights(n):
    """Return true if n has two eights in a row."""
    while n >= 88:
        if n % 100 == 88:
            return True
        n //= 10
    return False

